Art Gallery and Illumination Problems
نویسنده
چکیده
How many guards are necessary, and how many are sufficient to patrol the paintings and works of art in an art gallery with n walls? This wonderfully na¨ıve question of combinatorial geometry has, since its formulation, stimulated an increasing number of of papers and surveys. In 1987, J. O'Rourke published his book Art Gallery Theorems and Algorithms which has further fueled this area of research. The present book is being written almost 10 years since the publication of O'Rourke's book, and the need for an up-to-date manuscript on Art Gallery or Illumination Problems is evident. Some important open problems stated in O'Rourke's book, such as ... have been solved. New directions of research have since been investigated, including: watchman routes, floodlight illumination problems, guards with limited visibility or mobility, illumination of families of convex sets on the plane, guarding of rectilinear polygons, and others. In this book, we study these results and try to give a complete overview of all the results known to us. We hope that this book will provide a renewed source of inspiration towards the study of Art Gallery Problems.
منابع مشابه
Robust Face Recognition Using Probabilistic Facial Trait Code
Recently, Facial Trait Code (FTC) was proposed for solving face recognition, and was reported with promising recognition rates. However, several simplifications in the FTC encoding make it unable to handle the most rigorous face recognition scenario in which only one facial image per individual is available for enrollment in the gallery set and the probe set includes faces under variations caus...
متن کاملArt Galleries, Fortresses, and Prison Yards: Illumination and Color
An art gallery problem asks for the minimum number of guards needed to protect a given geometric object such as a polygon or polyhedron. We emphasize results obtained using coloring arguments graphs. We also introduce a new technique (same-sign graphs) that simplifies the proofs of several known theorems. – This talk is accessible for graduate students in all areas of math, as well as advanced ...
متن کاملAlgorithms for art gallery illumination
The Art Gallery Problem (AGP) is one of the classical problems in computational geometry. It asks for the minimum number of guards required to achieve visibility coverage of a given polygon. The AGP is well-known to be NP-hard even in restricted cases. In this paper, we consider the Art Gallery Problem with Fading (AGPF): A polygonal region is to be illuminated with light sources such that ever...
متن کاملSurvey of Terrain Guarding and Art Gallery Problems
The terrain guarding problem and art gallery problem are two areas in computational geometry. Different versions of terrain guarding involve guarding a discrete set of points or a continuous set of points on a terrain. The art gallery problem has versions including guarding an entire polygon by a set of discrete points at the vertices or any point inside the polygon itself. This paper will give...
متن کاملFisher Light-Fields for Face Recognition across Pose and Illumination
In many face recognition tasks the pose and illumination conditions of the probe and gallery images are di erent. In other cases multiple gallery or probe images may be available, each captured from a di erent pose and under a di erent illumination. We propose a face recognition algorithm which can use any number of gallery images per subject captured at arbitrary poses and under arbitrary illu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000